Shortest node-disjoint paths on random graphs
نویسندگان
چکیده
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length and the transition to the frustrated regime are analyzed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm. Shortest node-disjoint paths on random graphs 2
منابع مشابه
ar X iv : 1 40 1 . 80 96 v 2 [ co nd - m at . d is - n n ] 1 8 M ay 2 01 4 Shortest node - disjoint paths on random graphs
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...
متن کاملOn Node-to-Node Disjoint Paths in the Star Interconnection Network
We study the problem of finding disjoint paths between two nodes in a star interconnection network. Specifically, we show a simple routing algorithm that finds n − 1 disjoint paths between any two nodes s and t in an n-star in optimal O(n) time such that no path has length more than d(s, t) + 4, where d(s, t) is the shortest path length between s and t. This result matches those obtained earlie...
متن کاملAn Optimal Construction of Node-Disjoint Shortest Paths in Hypercubes
Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an ndimensional hypercube, provided the existence of such node-disjoint shortest paths which can be verified in O(m...
متن کاملThe K Shortest Paths Problem with Application to Routing
We present a simple algorithm for explicitly computing all k shortest paths bounded by length L from a fixed source to a target in O(m + kL) and O(mlogm + kL) time for unweighted and weighted directed graphs with m edges respectively. For many graphs, this outperforms existing algorithms by exploiting the fact that real world networks have short average path length. Consequently, we would like ...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.8096 شماره
صفحات -
تاریخ انتشار 2014